Minimum degree conditions for vertex-disjoint even cycles in large graphs

Degree sum conditions and vertex-disjoint cycles in a graph

We consider degree sum conditions and the existence of vertex-disjoint cycles in a graph. In this paper, we prove the following: Suppose that G is a graph of order at least 3k + 2 and σ3(G) ≥ 6k − 2, where k ≥ 2. Then G contains k vertex-disjoint cycles. The degree and order conditions are sharp.

Minimum Degree and Disjoint Cycles in Claw-Free Graphs

Minimum degree and disjoint cycles in generalized claw-free graphs

For s ≥ 3 a graph is K1,s-free if it does not contain an induced subgraph isomorphic to K1,s. Cycles in K1,3-free graphs, called clawfree graphs, have beenwell studied. In this paper we extend results on disjoint cycles in claw-free graphs satisfying certain minimum degree conditions to K1,s-free graphs, normally called generalized claw-free graphs. In particular, we prove that if G is K1,s-fre...

On vertex-disjoint cycles and degree sum conditions

This paper considers a degree sum condition sufficient to imply the existence of k vertexdisjoint cycles in a graph G. For an integer t ≥ 1, let σt (G) be the smallest sum of degrees of t independent vertices of G. We prove that if G has order at least 7k+1 and σ4(G) ≥ 8k−3, with k ≥ 2, then G contains k vertex-disjoint cycles. We also show that the degree sum condition on σ4(G) is sharp and co...

Vertex disjoint cycles for star free graphs

A graph is claw-free if it does not contain K I ,3 as an induced subgraph. A graph is KI,r-free if it does not contain KI,r as an induced subgraph. In this paper, we find bounds on the minimum number of edges needed to ensure a KI,.,.-free contains k vertex disjoint cycles. The bound on claw-free graphs is sharp.